Tuning Selection Pressure in Tournament Selection

نویسندگان

  • Huayang Xie
  • Mengjie Zhang
چکیده

Selection pressure controls the selection of individuals from the current population to produce a new population in the next generation. It gives individuals of higher quality a higher probability of being used to create the next generation so that Evolutionary Algorithms (EAs) can focus on promising regions in the search space. An evolutionary learning process is dynamic and requires different selection pressures at different learning stages in order to speed up convergence or avoid local optima. Therefore, it desires selection mechanisms being able to automatically tune selection pressure during evolution. Tournament selection is a popular selection method in EAs. This paper focuses on tournament selection and shows that standard tournament selection is unaware of the dynamics in the evolutionary process thus is unable to tune selection pressure automatically. This paper then presents a novel approach which integrates the knowledge of the Fitness Rank Distribution (FRD) of a population into tournament selection. Through mathematical modelling, simulations and experimental study, this paper shows that the new approach is effective and using the knowledge of FRD is a promising way to modify the standard tournament selection method for tuning the selection pressure dynamically and automatically along evolution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling Issues of Tournament Selection in Genetic Programming

Tournament selection is one of the most commonly used parent selection schemes in Genetic Programming (GP). While it has a number of advantages over other selection schemes, it still has some issues that need to be thoroughly investigated. Two of the issues are assocated with the sampling process from the population into the tournament. The first one is the socalled “multi-sampled” issue, where...

متن کامل

Genetic Algorithms , Tournament Selection , and the E ects of NoiseBrad

Tournament selection is a useful and robust selection mechanism commonly used by genetic algorithms. The selection pressure of tournament selection directly varies with the tournament size | the more competitors , the higher the resulting selection pressure. This article develops a model, based on order statistics, that can be used to quantitatively predict the resulting selection pressure of a...

متن کامل

An Analysis of Selection in Genetic Programming

This thesis presents an analysis of the selection process in tree-based Genetic Programming (GP), covering the optimisation of both parent and offspring selection, and provides a detailed understanding of selection and guidance on how to improve GP search effectively and efficiently. The first part of the thesis provides models and visualisations to analyse selection behaviour in standard tourn...

متن کامل

Calculating the Expected Loss of Diversity of Selection Schemes

This paper concerns a measure of selective pressure, called "loss of diversity," that denotes the proportion of unselected individuals during the selection phase. We probabilistically calculate the expected value and variance of loss of diversity in tournament selection, truncation selection, linear ranking selection, and exponential ranking selection. From numerical results, we observe that in...

متن کامل

Tournament Selection: Stable Fitness Pressure in XCS

Although it is known from GA literature that proportionate selection is subject to many pitfalls, the LCS community somewhat adhered to proportionate selection. Also in the accuracy-based learning classifier system XCS, introduced by Wilson in 1995, proportionate selection is used. This paper identifies problem properties in which performance of proportionate selection is impaired. Consequently...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009